Finite full transformation semigroups as collections of random functions
نویسندگان
چکیده
منابع مشابه
Variants of finite full transformation semigroups
The variant of a semigroup S with respect to an element a ∈ S, denoted S, is the semigroup with underlying set S and operation ? defined by x ? y = xay for x, y ∈ S. In this article, we study variants T a X of the full transformation semigroup TX on a finite set X. We explore the structure of T a X as well as its subsemigroups Reg(T a X) (consisting of all regular elements) and E X (consisting ...
متن کاملcompactifications and representations of transformation semigroups
this thesis deals essentially (but not from all aspects) with the extension of the notion of semigroup compactification and the construction of a general theory of semitopological nonaffine (affine) transformation semigroup compactifications. it determines those compactification which are universal with respect to some algebric or topological properties. as an application of the theory, it is i...
15 صفحه اولUNIVERSAL COMPACTIFICATIONS OF TRANSFORMATION SEMIGROUPS
We extend the notion of semigroup compactification to the class of transformation semigroups, and determine the compactifications which are universal with respect to some topological properties.
متن کاملPeriodic Functions for Finite Semigroups
This paper introduces the concept of ultimately periodic functions for nite semigroups. Ultimately periodic functions are shown to be the same as regularity-preserving functions in automata theory. This characterization reveals the true algebraic nature of regularity-preserving functions. It makes it possible to prove properties of ultimately periodic functions through automata-theoretic method...
متن کاملGreen's Relations in Finite Transformation Semigroups
We consider the complexity of Green’s relations when the semigroup is given by transformations on a finite set. Green’s relations can be defined by reachability in the (right/left/two-sided) Cayley graph. The equivalence classes then correspond to the strongly connected components. It is not difficult to show that, in the worst case, the number of equivalence classes is in the same order of mag...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Glasgow Mathematical Journal
سال: 1988
ISSN: 0017-0895,1469-509X
DOI: 10.1017/s0017089500007230